CONSTRAINT SOVLING ENGINE BASED NURSE ROSTERING WITH INTELLIGENT BACKTRACKING
نویسندگان
چکیده
منابع مشابه
Constraint Sovling Engine based Nurse rostering with Intelligent Backtracking
Efficient utilization of time and effort is essential in Personnel scheduling problems to evenly balance the workload among the people and attempt to satisfy the personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a different value for it. So here the mo...
متن کاملNurse and Paramedic Rostering with Constraint Programming: A Case Study∗
The nurse rostering problem consists in generating a configuration of daily schedules for a set of nurses satisfying a set of constraints. The problem is known to be computationally challenging as it must consider different requirements such as minimal area or floor allocations, different skills, working regulations, as well as personnel wishes. The literature presents several successful work d...
متن کاملIntelligent Backtracking on the Hardest Constraint Problems
A number of researchers have presented evidence that the hardest constraint satisfaction problems tend to arise near the \crossover" point, where around half the problems have solutions. Two recent papers , however, argue that while this is true of the median search cost, the mean search cost has an entirely diierent behavior. The mean search cost appears to be dominated by a relatively small n...
متن کاملA Constraint-directed Local Search Approach to Nurse Rostering Problems
In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iterati...
متن کاملCase-Bases Incorporating Scheduling Constraint Dimensions - Experiences in Nurse Rostering
This paper looks at work done on a case-based workforce scheduling application. Generalised patterns of workforce allocation are used to build up a schedule that is then adjusted to remove any problems. Because some constraint elements are incorporated in the case-base, the global problem search space is reduced. The case-base can be maintained either automatically, by generalisation of solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2014
ISSN: 1549-3636
DOI: 10.3844/jcssp.2014.1977.1984